Mathematical framework to show the existence of attractor of partitioned iterative function systems

نویسندگان

  • Suman K. Mitra
  • C. A. Murthy
چکیده

The technique of image compression using Iterative Function System (IFS) is known as fractal image compression. An extension of IFS theory is Partitioned or local Iterative Function System (PIFS) for coding the gray level images. Several techniques of PIFS based image compression have already been proposed by many researchers. The theory of PIFS appears to be different from the theory of IFS in the sense of application domain. The present article discusses some basic differences between IFS and PIFS and provides a separate mathematical formulation for the existence of attractor of partitioned IFS. In particular, it has been shown that the attractor exists and it is an approximation of the given target image. The experimental results have also been presented in support of the theory. The experimental results have been obtained by using a GA based PIFS technique proposed by Mitra et al [1]. key words : Image Compression, Iterative Fuction System (IFS), Partitioned Iterative Function System (PIFS), Attractor, Isometry.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The existence of global attractor for a Cahn-Hilliard/Allen-Cahn‎ ‎equation

In this paper, we consider a Cahn-Hillard/Allen-Cahn equation. By using the semigroup and the classical existence theorem of global attractors, we give the existence of the global attractor in H^k(0

متن کامل

A Study on Partitioned Iterative Function Systems for Image Compression

The technique of image compression using Iterative Function System IFS is known as fractal image compression An extension of IFS theory is called as Partitioned or local Iterative Function System PIFS for coding the gray level images The theory of PIFS appears to be di erent from that of IFS in the sense of application domain Assuming the theory of PIFS is same as that of IFS several techniques...

متن کامل

‎Finite iterative methods for solving systems of linear matrix equations over reflexive and anti-reflexive matrices

A matrix $Pintextmd{C}^{ntimes n}$ is called a generalized reflection matrix if $P^{H}=P$ and $P^{2}=I$‎. ‎An $ntimes n$‎ ‎complex matrix $A$ is said to be a reflexive (anti-reflexive) matrix with respect to the generalized reflection matrix $P$ if $A=PAP$ ($A=-PAP$)‎. ‎In this paper‎, ‎we introduce two iterative methods for solving the pair of matrix equations $AXB=C$ and $DXE=F$ over reflexiv...

متن کامل

Existence and Iterative Approximations of Solution for Generalized Yosida Approximation Operator

In this paper, we introduce and study a generalized Yosida approximation operator associated to H(·, ·)-co-accretive operator and discuss some of its properties. Using the concept of graph convergence and resolvent operator, we establish the convergence for generalized Yosida approximation operator. Also, we show an equivalence between graph convergence for H(·, ·)-co-accretive operator and gen...

متن کامل

Solving systems of nonlinear equations using decomposition technique

A systematic way is presented for the construction of multi-step iterative method with frozen Jacobian. The inclusion of an auxiliary function is discussed. The presented analysis shows that how to incorporate auxiliary function in a way that we can keep the order of convergence and computational cost of Newton multi-step method. The auxiliary function provides us the way to overcome the singul...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Pattern Recognition

دوره 33  شماره 

صفحات  -

تاریخ انتشار 2000